Quantum Private Information Retrieval has Linear Communication Complexity
نویسندگان
چکیده
منابع مشابه
Quantum Private Information Retrieval with Sublinear Communication Complexity
This note presents a quantum protocol for private information retrieval, in the case of a single (honest) server and with information-theoretical privacy, that has O( √ n)qubit communication complexity, where n denotes the size of the database. In comparison, it is known that any classical protocol must use Ω(n) bits of communication in this setting. ACM Classification: F.2.3 AMS Classification...
متن کاملUpper Bound on Communication Complexity of Private Information Retrieval
We construct a scheme for private information retrieval with k databases and communication complexity O(n 1=(2k?1)).
متن کاملA Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval
We study the communication complexity of single-server Private Information Retrieval (PIR) protocols that are based on fundamental cryptographic primitives in a black-box manner. In this setting, we establish a tight lower bound on the number of bits communicated by the server in any polynomially-preserving construction that relies on trapdoor permutations. More specifically, our main result st...
متن کاملQuantum Symmetrically-Private Information Retrieval
Private information retrieval systems (PIRs) allow a user to extract an item from a database that is replicated over k ≥ 1 servers, while satisfying various privacy constraints. We exhibit quantum k-server symmetrically-private information retrieval systems (QSPIRs) that use sublinear communication, do not use shared randomness among the servers, and preserve privacy against honest users and di...
متن کاملComputationally Private Information Retrieval with Polylogarithmic Communication
We present a single-database computationally private information retrieval scheme with polylogarithmic communication complexity. Our construction is based on a new, but reasonable intractability assumption, which we call the Φ-Hiding Assumption (ΦHA): essentially the difficulty of deciding whether a small prime divides φ(m), where m is a composite integer of unknown factorization.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Cryptology
سال: 2014
ISSN: 0933-2790,1432-1378
DOI: 10.1007/s00145-014-9180-2